A Bounded Spin Lock Algorithm with Preemption

نویسندگان

  • Hiroaki Takada
  • Ken Sakamura
چکیده

Predictable interprocessor synchronization and fast interrupt response are important for real-time systems constructed using asymmetric shared-memory multiprocessors. This paper points out the problem that existing spin lock algorithms cannot satisfy both requirements at the same time, and proposes a new algorithm to solve this problem. The algorithm, an extension of queueing spin locks modi ed to be preemptable for servicing interrupts, can give an upper bound on the time to acquire and release an interprocessor lock while achieving fast response to interrupt requests. The e ectiveness of the algorithm is demonstrated through performance evaluation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predictable Spin Lock Algorithms with Preemption

Both predictable interprocessor synchronization and fast interrupt response are required for real-time systems constructed using asymmetric shared-memory multiprocessors. This paper points out the problem that conventional spin lock algorithms cannot satisfy both requirements at the same time. To solve this problem, we have proposed an algorithm which is an extension of queueing spin locks modi...

متن کامل

Towards Scalable Multiprocessor Virtual Machines

A multiprocessor virtual machine benefits its guest operating system in supporting scalable job throughput and request latency—useful properties in server consolidation where servers require several of the system processors for steady state or to handle load bursts. Typical operating systems, optimized for multiprocessor systems in their use of spin-locks for critical sections, can defeat flexi...

متن کامل

Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory

Most multiprocessors are multiprogrammed to achieve acceptable response time and to increase their utilization. Unfortunately, inopportune preemption may significantly degrade the performance of synchronized parallel applications. To address this problem, researchers have developed two principal strategies for a concurrent, atomic update of shared data structures: (1) preemption-safe locking an...

متن کامل

Scalable Read-mostly Synchronization Using Passive Reader-Writer Locks

Reader-writer locks (rwlocks) aim to maximize parallelism among readers, but many existing rwlocks either cause readers to contend, or significantly extend writer latency, or both. Further, some scalable rwlocks cannot cope with OS semantics like sleeping inside critical sections, preemption and conditional wait. Though truly scalable rwlocks exist, some of them cannot handle preemption, sleepi...

متن کامل

Scheduling a constellation of agile earth observation satellites with preemption

In this paper, we consider a scheduling problem for a set of agile Earth observation satellites for scanning  different parts of the Earth’s surface. We assume that preemption is allowed to prevent repetitive images and develop four different preemption policies. Scheduling is done for the imaging time window and transmission time domain to the Earth stations as well. The value of each picture ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993